Analyticity for Classical Gasses via Recursion

Bounded rationality via recursion

Current trends for model construction in the field of Agentbased Computational Economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictitious play, Bayesian learning) or are inspired by theArtificial Intelligence (e.g. reinforcement learning). Evidence from experiments with human subjects puts the first approach in doubt, whereas the second one imposes s...

Modified Bar Recursion and Classical Dependent Choice

General recursion via coinductive types

A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations, implementation of operational semantics, formalization of domain theory, and inductive definition of domain predicates. Here, a different solution is proposed: exploiti...

Applications of Classical Recursion Theory to Computer Science

Three applications oE intensional recursion theory to computer science are presented. Proof Lechn iqut.-.i are used, in some cases, as a criterion of appliciibiLity. The first example distinguishes various tormy of recursion as programming tools. A highly iccur-jivc proof of the famous speed up theorem from complexity theory is presented. The final application concerns the synthesis of programs...

Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis

This paper is about the bar recursion operator in the context of classical realizability. The pioneering work of Berardi, Bezem, Coquand [1] was enhanced by Berger and Oliva [2]. Then Streicher [12] has shown, by means of their bar recursion operator, that the realizability models of ZF, obtained from usual models of λ-calculus (Scott domains, coherent spaces, . . . ), satisfy the axiom of depe...